A Note on the Minimum Wiener Polarity Index of Trees with a Given Number of Vertices and Segments or Branching Vertices
نویسندگان
چکیده
منابع مشابه
The minimum number of vertices in uniform hypergraphs with given domination number
The domination number γ(H) of a hypergraph H = (V (H), E(H)) is the minimum size of a subset D ⊂ V (H) of the vertices such that for every v ∈ V (H) \D there exist a vertex d ∈ D and an edge H ∈ E(H) with v, d ∈ H. We address the problem of finding the minimum number n(k, γ) of vertices that a k-uniform hypergraph H can have if γ(H) ≥ γ and H does not contain isolated vertices. We prove that n(...
متن کاملThe Wiener polarity index of molecular graphs of alkanes with a given number of methyl groups
Among various topological indices considered in chemical graph theory, only a few have been widely studied in mathematical and chemical literatures. However, it seems that less attention has been paid to the Wiener polarity index. It was introduced by Harold Wiener1 for acyclic molecules in 1947. The Wiener polarity index of an organic molecule the molecular graph of which is G = (V,E) is defin...
متن کاملThe Asymptotic Number of Labeled Connected Graphs with a Given Number of Vertices and Edges
Let c(n, q) be the number of connected labeled graphs with n vertices and q 5 N = ( ) edges. Let x = q/n and k = q n. We determine functions w k 1 , a(x ) and cp(x) such that c (n , q) w k ( z ) e n r p ( x ) e o ( x ) uniformly for all n and q 2 n. If Q > O is fixed, n+= and 4q > ( 1 + ~ ) n log n, this formula simplifies to c(n, q) ( t ) exp(-ne-zq’n). On the other hand, if k = o(n”’), this f...
متن کاملThe asymptotic number of labelled weakly-connected digraphs with a given number of vertices and edges
Edward A. Benderl Depariment of Mathel1wtics, University of California, San Diego, La Jolla, CA 92093, USA E. Rodney Canfieldl Department of Computer Science, University of Georgia, Athens, GA 30602, USA Brendan D. McKay2 Computer Science Department, Australian National University, GPO Box 4, ACT 2601., Australia In a recent paper, we determined the asymptotic number of labelled connected graph...
متن کاملUnicyclic radially-maximal graphs on the minimum number of vertices
We characterize unicyclic, non-selfcentric, radially-maximal graphs on the minimum number of vertices. Such graphs must have radius r ≥ 5, and we prove that the number of these graphs is 1 48 r + O(r).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Dynamics in Nature and Society
سال: 2021
ISSN: 1607-887X,1026-0226
DOI: 10.1155/2021/1052927